Computing Reachability Properties Hidden in Finite Net Unfoldings
نویسنده
چکیده
It is commonly known that every reachable marking of a nite-state Petri net system is represented in its nite unfolding according to McMillan. Also the reachability of markings from each other is represented in the nite unfolding, but it is almost unknown that this information can be hidden very deep. This paper presents an eecient method for gaining this information, which is of course of great importance for potential modelcheckers working on nite unfoldings. All results presented in this paper also hold for a recently proposed optimized unfolding method.
منابع مشابه
Goal-Driven Unfolding of Petri Nets
Unfoldings provide an efficient way to avoid the state-space explosion due to interleavings of concurrent transitions when exploring the runs of a Petri net. The theory of adequate orders allows one to define finite prefixes of unfoldings which contain all the reachable markings. In this paper we are interested in reachability of a single given marking, called the goal. We propose an algorithm ...
متن کاملOptimising Enabling Tests and Unfoldings of Algebraic System Nets
Reachability analysis and simulation tools for high-level nets spend a significant amount of the computing time in performing enabling tests, determining the assignments under which transitions are enabled. Unlike the majority of earlier work on computing enabled transition bindings, the techniques presented in this paper are highly independent of the algebraic operations supported by the high-...
متن کاملCombining symbolic and partial order methods for model checking 1-safe Petri nets
In this work, methods are presented for model checking finite state asynchronous systems, more specifically 1-safe Petri nets, with the aim of alleviating the state explosion problem. Symbolic model checking techniques are used, combined with two partial order semantics known as net unfoldings and processes. We start with net unfoldings and study deadlock and reachability checking problems, usi...
متن کاملModel Checking with Finite Complete Prefixes Is PSPACE-Complete
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a symbolic representation of an interleaved reachability graph. We show that model checking a fixed size formula of several temporal logics, including LTL, CTL, and CTL∗, is PSPACE-complete in the size of a finite complete...
متن کاملAn Algorithm for Petri Nets Reachability by Unfoldings
This paper proposes an algorithm for analyzing the reachability property of Petri nets by the use of unfoldings. It is known that analyzing the reachability by using unfoldings requires exponential time and space to the size of unfolding. The algorithm is based on the branch and bound technique, and experimental results show efficiency of the algorithm. key words: Petri nets, unfoldings, reacha...
متن کامل